Fast Mesh Simplification for Progressive Transmission
نویسندگان
چکیده
A very fast mesh simplification algorithm based on halfedge collapse is proposed in this work with a focus on progressive graphic transmission applications. We generalize the Quadric Error Metric (QEM) method to accommodate new topological operations. A flatness criterion is combined with the defined metric to preserve the visual quality of simplified meshes. We further adopt the vertex-based priority queue to accelerate the simplification speed. It is shown by experimental results that our method can achieve similar results as the QEM algorithm with a faster speed.
منابع مشابه
Fast Stellar Mesh Simplification
This paper introduces Stellar Simplification, a fast implementation of the Four–Face Cluster algorithm. In our version of this mesh simplification scheme, we adopt a probabilistic heuristic that substitutes the priority queue of the original algorithm. This made our version, in average, 40% faster. In our implementation, we adopt a very concise data structure which uses only two arrays of integ...
متن کاملProgressive linear triangle surface mesh implementation. Pitfalls and challenges
The need of progressive mesh scheme originated from an idea of web servicebased ordered computations system described in [6]. Progressive format introduced by Hoppe in [2, 3] was found very suitable in the Internet transmission of large data sets. In result of its flexibility, many derivatives was developed [5, 8]. Despite its straightforward basis, there are some challenges that must to be ove...
متن کاملSimplification of Arbitrary Polyhedral Meshes
Surface models containing billions of polygons are becoming more frequent in computer graphics. Mesh simplification is necessary for displaying such surfaces at interactive rates. We describe a novel method for simplifying polyhedral meshes while producing multiple levels of detail for progressive transmission and interactive exploration. Unlike previous work on mesh simplification, our method ...
متن کاملCombined compression and simplification of dynamic 3D meshes
We present a new approach to dynamic mesh compression, which combines compression with simplification to achieve improved compression results, a natural support for incremental transmission and level of detail. The algorithm allows fast progressive transmission of dynamic 3D content. Our scheme exploits both temporal and spatial coherency of the input data, and is especially efficient for the c...
متن کاملCritique for CS448B: Geometric Modeling Progressive Simplicial Complexes
This paper details a proposed format, referred to as “Progressive Simplicial Complexes (PSC),” for storing and transmitting triangulated geometric models. The idea behind the PSC format is to provide a unified approach to mesh simplification and mesh compression. Mesh simplification and compression accelerates graphical rendering, decreases the required storage, and reduces the transmission cos...
متن کامل